Nonnegative matrices A with AA♯⩾0
نویسندگان
چکیده
منابع مشابه
Nonnegative Matrices
For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.
متن کاملEmbedding nonnegative definite Toeplitz matrices in nonnegative definite circulant matrices, with application to covariance estimation
Ahtract -The class of nonnegative definite Toeplitz matrices that can be embedded in nonnegative definite circulant matrices of larger sue is characterized. An equivalent characterization in terms of the spectrum of the underlying process is also presented, together with the corresponding extrema1 processes. It is shown that a given finite duration sequence p can be extended to be the covarianc...
متن کاملMonotonicity of Nonnegative Matrices
We present a nonnegative rank factorization of a nonnegative matrix A for the case in which one or both of A(1)A and AA(1) are nonnegative. This gives, in particular, a known result for characterizing nonnegative matrices when A†A or AA† is nonnegative. We applied this characterization to the derivation of known results based on the characterization of nonnegative monotone matrices. A matrix A ...
متن کاملNonnegative matrices with prescribed extremal singular values
We consider the problem of constructing nonnegative matrices with prescribed extremal singular values. In particular, given 2n−1 real numbers σ ( j) 1 and σ ( j) j , j = 1, . . . , n, we construct an n×n nonnegative bidiagonal matrix B and an n×n nonnegative semi-bordered diagonal matrix C , such that σ ( j) 1 and σ ( j) j are, respectively, the minimal and the maximal singular values of certai...
متن کاملFactoring nonnegative matrices with linear programs
This paper describes a new approach for computing nonnegative matrix factorizations (NMFs) with linear programming. The key idea is a data-driven model for the factorization, in which the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X , the algorithm identifies a matrix C that satisfies X ≈ CX and some linear constraints. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2004
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.07.007